Sd-Index of Another Case of Pericondensed Benzenoid Graphs G(m, n, k)
نویسندگان
چکیده
منابع مشابه
Topological Characteristics of Strictly Pericondensed Constant-Isomer Benzenoid Series
Using the formula periodic table for benzenoids (Table PAH6 = Table 1 in [4]) and the excised internal structure concept, several new strictly peri-condensed series possessing an identical number of isomers have been identified [5]. Strictly peri-condensed benzenoids have the property that the graph spanned by their internal carbon vertices (i.e., their excised internal structure) is connected....
متن کاملBenzenoid series having a constant number of isomers. 2. Topological characteristics of strictly pericondensed constant-isomer benzenoid series
für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...
متن کاملGM animals - another GM crops?
As new biotechnologies are developed, the parallels with GM crops are often drawn. In this paper, I consider GM animals and contrast them with GM crops. I use a systems of innovation perspective to consider innovation, product markets and regulatory systems and suggest that whilst there are some parallels between GM crops and animals there are also clear differences. There are differences in th...
متن کاملEstrada Index of Benzenoid Hydrocarbons
A structure-descriptor EE, recently proposed by Estrada, is examined. If λ1, λ2, . . . ,λn are the eigenvalues of the molecular graph, then EE = n ∑ i=1 eλi . In the case of benzenoid hydrocarbons with n carbon atoms and m carbon-carbon bonds, EE is found to be accurately approximated by means of the formula a1 n cosh (√ 2m/n ) +a2, where a1 ≈ 1.098 and a2 =−0.64 are empirically determined fitt...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Science and Engineering
سال: 2018
ISSN: 2321-0745,2322-0465
DOI: 10.30954/2322-0465.2.2018.6